Computably inseparable
IN COMPUTABILITY THEORY, PAIRS OF SETS OF NATURAL NUMBERS THAT CANNOT BE "SEPARATED" WITH A RECURSIVE SET
Effectively separable; Effectively separable set; Effectively separable sets; Effectively inseparable; Effectively inseparable sets; Recursively separable sets; Recursively separable; Recursively inseparable; Recursive inseparability; Recursively inseparable sets
In computability theory, two disjoint sets of natural numbers are called computably inseparable or recursively inseparable if they cannot be "separated" with a computable set.Monk 1976, p.